Agent Based Decomposition of Optimization Problems
نویسندگان
چکیده
In this paper, we present an agent-based approach for solving an optimization problem using a Dantzig-Wolfe column generation scheme, i.e., a decomposition approach. It has been implemented and tested on an integrated production, inventory, and distribution routing problem. We developed a decomposition model for this optimization problem, which was implemented in the Java programming language, using the Java Agent DEvelopment Framework (JADE) and the ILOG CPLEX mixed integer linear problem solver. The model was validated on a realistic scenario and based on the results, we present estimates of the potential performance gain by using a completely distributed implementation. We also analyze the overhead, in terms of communication costs, imposed by an agent based approach. Further we discuss the advantages and the disadvantages that comes with an agent-based decomposition approach.
منابع مشابه
A MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM USING DECOMPOSITION (MOEA/D) AND ITS APPLICATION IN MULTIPURPOSE MULTI-RESERVOIR OPERATIONS
This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...
متن کاملMulti Agent Collaborative Search based on Tchebycheff decomposition
This paper presents a novel formulation ofMulti Agent Collaborative Search, for multi-objective optimization, based on Tchebycheff decomposition. A population of agents combines heuristics that aim at exploring the search space both globally (social moves) and in a neighborhood of each agent (individualistic moves). In this novel formulation the selection process is based on a combination of Tc...
متن کاملA hybrid multiagent approach for global trajectory optimization
In this paper we consider a global optimization method for space trajectory design problems. The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers (corresponding to a set of different design options), is based on a domain decomposition technique where each subdomain is evaluated through a procedure based on the evolution of a popu...
متن کاملMulti-objective optimization design of plate-fin heat sinks using an Evolutionary Algorithm Based On Decomposition
This article has no abstract.
متن کاملDecomposition-Based Optimal Market-Based Planning for Multi-Agent Systems with Shared Resources
Market-based algorithms have become popular in collaborative multi-agent planning due to their simplicity, distributedness, low communication requirements, and proven success in domains such as task allocation and robotic exploration. Most existing marketbased algorithms, however, suffer from two main drawbacks: resource prices must be carefully handcrafted for each problem domain, and there is...
متن کامل